The Encoding of Avestan - Problems and Solutions
نویسنده
چکیده
Avestan’ is the name of the ritual language of Zoroastrianism, which was the state religion of the Iranian empire in Achaemenid, Arsacid and Sasanid times, covering a time span of more than 1200 years. It is named after the ‘Avesta’, i.e., the collection of holy scriptures that form the basis of the religion which was allegedly founded by Zarathushtra, also known as Zoroaster, by about the beginning of the first millennium B.C. Together with Vedic Sanskrit, Avestan represents one of the most archaic witnesses of the Indo-Iranian branch of the Indo-European languages, which makes it especially interesting for historical-comparative linguistics. This is why the texts of the Avesta were among the first objects of electronic corpus building that were undertaken in the framework of Indo-European studies, leading to the establishment of the TITUS database (‘Thesaurus indogermanischer Textund Sprachmaterialien’). 2 Today, the complete Avestan corpus is available, together with elaborate search functions and an extended version of the subcorpus of the so-called ‘Yasna’, which covers a great deal of the attestation of variant readings. Right from the beginning of their computational work concerning the Avesta, the compilers had to cope with the fact that the texts contained in it have been transmitted in a special script written from right to left, which was also used for printing them in the scholarly editions used until today. It goes without saying that there was no way in the middle of the 1980s to encode the Avestan scriptures exactly as they are found in the manuscripts. Instead, we had to rely upon transcriptional devices that were dictated by the restrictions of character encoding as provided by the computer systems used. As the problems we had to face in this respect and the solutions we could apply are typical for the development of computational work on ancient languages, it seems worthwhile to sketch them out here. 1 The Avestan script and its transcription 1.1 Early western approaches to the Avestan script and its transcription The Avestan script has been known to western scholarship since the 17 century when the first accounts of the religion of the ‘Parsees’, i.e., Zoroastrians living in India and Iran, were published. The first notable description of the script is found in the travel report by JEAN CHARDIN who sojourned in Iran in 1673–7; in the 1711 edition of his report, the author provides an ‘alphabet of the ancient Persians’, together with a lithographed table contrasting the characters of the Avestan script with their Perso-Arabian equivalents; cf. the extract illustrated in Fig. 1.
منابع مشابه
How to kill a cow in Avestan
Dies ist eine Internet-Sonderausgabe des Aufsatzes " How to kill a cow in Avestan " von Jost Gippert (1996). Sie sollte nicht zitiert werden. Zitate sind der Originalausgabe in Mír curad. Studies in honor of Calvert Watkins, Attention! This is a special internet edition of the article " How to kill a cow in Avestan " by Jost Gippert (1996). It should not be quoted as such. For quotations, pleas...
متن کاملPeculiarities of Avestan Manuscripts for Computational
This paper will discuss several computational tools for creating a stemma of Avestan manuscripts, such as: a letter similarity matrix, a morphological expander, and co-occurrence networks. After a short introduction to Avestan and Avestan manuscripts and a representation of Avestan peculiarities concerning the creation of stemmata, the operatability of the above-mentioned tools for this text co...
متن کاملPeculiarities of Avestan Manuscripts for Computational Linguistics
This paper will discuss several computational tools for creating a stemma of Avestan manuscripts, such as: a letter similarity matrix, a morphological expander, and co-occurrence networks. After a short introduction to Avestan and Avestan manuscripts and a representation of Avestan peculiarities concerning the creation of stemmata, the operatability of the above-mentioned tools for this text co...
متن کاملA strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JLCL
دوره 27 شماره
صفحات -
تاریخ انتشار 2012